Scaling Analysis for the Adsorption Transition in a Watermelon Network of n Directed Non-Intersecting Walks

نویسندگان

  • A. L. Owczarek
  • J. W. Essam
چکیده

The partition function for the problem of n directed non-intersecting walks interacting via contact potentials with a wall parallel to the direction of the walks has previously been calculated as an n× n determinant. Here, we describe how to analyse the scaling behaviour of this problem using alternative representations of the solution. In doing so we derive the asymptotics of the partition function of a watermelon network of n such walks for all temperatures, and so calculate the associated network exponents in the three regimes: desorbed, adsorbed, and at the adsorption transition. Furthermore, we derive the full scaling function around the adsorption transition for all n. At the adsorption transition we also derive a simple “product form” for the partition function. These results have, in part, been derived using recurrence relations satisfied by the original determinantal solution. In honour of the 60th Birthday of R. J. Baxter PACS numbers: 05.50.+q, 05.70.fh, 61.41.+e

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact solution for semi-flexible partially directed walks at an adsorbing wall

Abstract. Recently it was shown that the introduction of stiffness into the model of self-interacting partially directed walks modifies the polymer collapse transition seen from a second-order to a first-order one. Here we consider the effect of stiffness on the adsorption transition. We provide the exact generating function for non-interacting semi-flexible partially directed walks and analyse...

متن کامل

Non-intersecting, Simple, Symmetric Random Walks and the Extended Hahn Kernel

Consider a particles performing simple, symmetric, non-intersecting random walks, starting at points 2(j − 1), 1 ≤ j ≤ a at time 0 and ending at 2(j − 1)+ c − b at time b + c. This can also be interpreted as a random rhombus tiling of an abc-hexagon, or as a random boxed planar partition confined to a rectangular box with side lengths a, b and c. The positions of the particles at all times give...

متن کامل

Exact solution of semi-flexible and super-flexible interacting partially directed walks

We provide the exact generating function for semi-flexible and super-flexible interacting partially directed walks and also analyse the solution in detail. We demonstrate that while fully flexible walks have a collapse transition that is second order and obeys tricritical scaling, once positive stiffness is introduced the collapse transition becomes first order. This confirms a recent conjectur...

متن کامل

Network Discovery by Generalized Random Walks

We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition probabilities (STP), for the average number of discovered edges as function of time. We show that for STP walks site and edge exploration obey the same scaling∼ n as f...

متن کامل

Exact solution of N directed non-intersecting walks interacting with one or two boundaries

The partition function for the problem of an arbitrary number of directed nonintersecting walks interacting with one or two walls parallel to the direction of the walks is calculated exactly utilizing a theorem recently proved concerning the Bethe ansatz for the eigenvectors of the transfer matrix of the five-vertex model. This theorem shows that the completeness of the Bethe ansatz eigenvector...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000